数字压力计检定装置

在贵州国防区域计量站5505校准实验室建立了一套数字压力计检定装置,可满足对区域内各工厂开展数字式压力仪器检定的要求.     

Representation of shift-invariant operators onL 2 byH ∞ transfer functions: An elementary proof,a generalization toL p,and a counterexample forL ∞

We give an elementary proof of the well-known fact that shift-invariant operators onL ²[0, ∞) are represented by transfer functions which are bounded and analytic on the right open half-plane. We prove a generalization to Banach space-valuedL ^p -functions, where 1≤p<∞. We show that the result no longer holds forp=∞. This research was supported partially by the Weizmann Fellowship, and partially by the Air Force Office of Scientific Research under Contract F49620-86-C-0111.     

中子测井仪刻度管理系统

介绍了补偿中子测井仪刻度的基本原理及在Windows98平台下利用Borland C Builder5.0^[1]编程环境开发的中子测井仪刻度管理软件，实现了对中子测井仪的刻度管理，列举了应用实例。     

A novel MINLP-based representation of the original complex model for predicting gasoline emissions

The Environmental Protection Agency (EPA) introduced Reformulated Gasoline (RFG) requirements as a measure to reduce emissions from gasoline-powered vehicles in certain geographic areas. As part of this effort, the EPA developed empirical models for predicting emissions as a function of gasoline properties and established statutory baseline emissions from a representative set of gasolines. All reformulated gasoline requires certification via this model, known as the Complex Model, and all refiners and importers calculate emissions performance reductions from the statutory baseline gasoline. The current representation of the Complex Model is extremely difficult to implement within refinery operations models or to use in combination with models for designer gasoline. RFG and boutique fuels are key driving forces in the North American refining industry.The RFG models introduce increasingly complex constraints with the major limitation that they are implicitly defined through a series of complicated disjunctions assembled by the EPA in the form of spreadsheets. This implicit and cumbersome representation of the emissions predictive models renders rigorous optimization and sensitivity analysis very difficult to address directly. In this paper, we discuss how the federal government requirements for reformulated gasoline can be restated as a set of mixed-integer nonlinear programming (MINLP) constraints with the aid of disjunctive programming techniques. We illustrate the use of this model with two simple example fuel blending problems.     

Playing with Maude

This paper is an introduction to rule-based programming in Maude. We illustrate in particular the use of operator attributes to structure the state of a system, and the difference between equations and rules. We use well-known mathematical games and puzzles for our examples illustrating the expressive power of Maude.     

Controlled linear system with delayed relay output under impulse random disturbances

The paper is devoted to the first order delayed linear system with relay output controlled by the proportional-integral (PI) regulator. The deterministic system exhibits stable oscillations, and, since the system itself is stable, it can be suitable to switch off the controller if there are no disturbances during a long time interval. In the present work, the random disturbances are modelled by a Poisson stream of impulses, and the goal is to determine the instants of switching on (off) of the PI controller. After several assumptions and quantization of the time axis, we construct the new optimal control problem which is successfully solved with the help of the dynamic programming approach.     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

Solving the small sample size problem in face recognition using generalized discriminant analysis

The goal of face recognition is to distinguish persons via their facial images. Each person's images form a cluster, and a new image is recognized by assigning it to the correct cluster. Since the images are very high-dimensional, it is necessary to reduce their dimension. Linear discriminant analysis (LDA) has been shown to be effective at dimension reduction while preserving the cluster structure of the data. It is classically defined as an optimization problem involving covariance matrices that represent the scatter within and between clusters. The requirement that one of these matrices be nonsingular restricts its application to datasets in which the dimension of the data does not exceed the sample size. For face recognition, however, the dimension typically exceeds the number of images in the database, resulting in what is referred to as the small sample size problem. Recently, the applicability of LDA has been extended by using the generalized singular value decomposition (GSVD) to circumvent the nonsingularity requirement, thus making LDA directly applicable to face recognition data. Our experiments confirm that LDA/GSVD solves the small sample size problem very effectively as compared with other current methods.     

Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.